Algorithms Reading Group Scribes for September 03, 2010: The Parking Problem

نویسنده

  • Dzejla Medjedovic
چکیده

The first session of this semester’s Algorithms Reading Group dealt with the problem of parking cars on the streets of New York City. The goal is to analyze different parking behaviors and observe to what extent following some parking strategy can affect the maximum number of cars that can be parked on the street. Such analysis can be useful for finding out what parking patterns provide the maximum utilization of the street space. In addition, this problem has the secret motivation. Figure 1 represents a sketch of the invention by Prof. Skiena. We speculate that it has to do with the initiative to improve the parking habits of New Yorkers, but the details of the idea have not been fully revealed yet; we do know, however, that the analysis of various parking behaviors is of great importance for this project.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Urban Vehicle Congestion Pricing: A Review

Drivers in urban neighborhoods who cruise streets, seeking inexpensive on-street parking create a significant fraction of measured traffic congestion. The solution to this problem is to reduce the total traffic volume including cruising traffic by implementing a congestion pricing scheme: the imposition of a usage fee on a limited-capacity resource during times of high demand. We review the his...

متن کامل

Mapping Reading Anxiety on Reading Strategy Uses among Iranian Students with Diverse Proficiency Levels

The present study was an attempt to determine a relationship between foreign language reading anxiety and reading strategy use among a group of EFL Iranian readers (no = 100) with low vs. high proficiency levels. To this end, FLRAS (Foreign Language Reading Anxiety Scale) developed by Saito, Horwitz, and Garza, (1999) was used in order to measure the participants’ level of anxiety in reading an...

متن کامل

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Environmental Studies Research Series Working Papers 2003 Testing the Sensitivity of Parking Behaviour and Modal Choice to the Price of On-street Parking

Parking pricing has been suggested as a 'second-best' approach to managing road space. However, its effectiveness will depend upon the responsiveness of parking behaviour and modal choice to the price of parking. This paper examines the sensitivity of parking behaviour and modal choice to the price of on-street parking in the city of Dublin, Ireland. This analysis utilises contingent valuation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010